IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Data Processing Bounds for Scalar Lossy Source Codes with Side Information at the Decoder
نویسندگان
چکیده
In this paper, we introduce new lower bounds on the distortion of scalar fixedrate codes for lossy compression with side information available at the receiver. These bounds are derived by presenting the relevant random variables as a Markov chain and applying generalized data processing inequalities a la Ziv and Zakai. We show that by replacing the logarithmic function with other functions, in the data processing theorem we formulate, we obtain new lower bounds on the distortion of scalar coding with side information at the decoder. These bounds are shown to be better than one can obtain from the Wyner-Ziv rate-distortion function.
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Zero-Delay and Causal Single- User and Multi-User Lossy Source Coding with Decoder Side Information
We consider zero-delay single-user and multi-user lossy source coding with decoder side information. The zero-delay constraint translates into causal (sequential) encoder and decoder pairs as well as the use of instantaneous codes. For the single-user setting, we show that optimal performance is attained by time sharing at most two scalar encoder-decoder pairs, that use zero-error side informat...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Structure Theorems for Real- Time Variable Rate Coding With and Without Side Information
The output of a discrete Markov source is to be encoded instantaneously by a variable–rate encoder and decoded by a finite–state decoder. Our performance measure is a linear combination of the distortion and the instantaneous rate. Structure theorems, pertaining to the encoder and next–state functions are derived for every given finite–state decoder, which can have access to side information.
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Efficient On-line Schemes for Encoding Individual Sequences with Side Information at the Decoder
We present adaptive on-line schemes for lossy encoding of individual sequences under the conditions of the Wyner-Ziv (WZ) problem, i.e., the decoder has access to side information whose statistical dependency on the source is known. Both the source sequence and the side information consist of symbols taking on values in a finite alphabet X . In the first part of this article, a set of fixed-rat...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES A Large Deviations Approach to Secure Lossy Compression
We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the compression rate, as well as a constraint on the exponential rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the exponen...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES On the Statistical Physics of Directed Polymers in a Random Medium and Their Relation to Tree-Structed Lossy Compression
Using well–known results from statistical physics, concerning the almost–sure behavior of the free energy of directed polymers in a random medium, we prove that a certain ensemble of tree–structured rate–distortion codes with delayless decoding, asymptotically achieves the rate–distortion function under a certain symmetry condition.
متن کامل